N-tuple Algebra-based Probabilistic Logic
نویسنده
چکیده
The concept of “probabilistic logic” known in artificial intelligence needs a more thorough substantiation. A new approach to constructing probabilistic logic based on the N-tuple algebra developed by the author is proposed. A brief introduction is given to the N-tuple algebra and its properties that provide efficient paralleling of algorithms for solving problems of logical analysis of systems in computer implementation are generalized. Methods for solving direct and inverse problems of probabilistic simulation of logical systems are considered.
منابع مشابه
A Probabilistic NF2 Relational Algebra for Imprecision in Databases
We present a probabilistic data model which is based on relations in non-rst-normal-form (NF2). Here, tuples are assigned probabilistic weights giving the probability that a tuple belongs to a relation. This way, imprecise attribute values are modelled as a probabilistic subrelation. For information retrieval, the set of weighted index terms of a document can be represented in the same way, thu...
متن کاملA Probabilistic Data Model and Its Semantics
As database systems are increasingly being used in advanced applications, it is becoming common that data in these applications contain some elements of uncertainty. These arise from many factors, such as measurement errors and cognitive errors. As such, many researchers have focused on defining comprehensive uncertainty data models of uncertainty database systems. However, existing uncertainty...
متن کاملA Probabilistic NF2 Relational Algebra for Integrated Information Retrieval and Database Systems
The integration of information retrieval (IR) and database systems requires a data model which allows for modelling documents as entities, representing uncertainty and vagueness and performing uncertain inference. For this purpose, we present a probabilistic data model based on relations in non-rst-normal-form (NF2). Here, tuples are assigned probabilistic weights giving the probability that a ...
متن کاملA Design Methodology for Reliable MRF-Based Logic Gates
Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...
متن کاملCoalgebraic semantics for logic programs
General logic programs with negation have the 3-valued minimal Herbrand models based on the Kripke’s fixpoint knowledge revision operator and on Clark’s completion. Based on these results we deifine a new algebra , (with the relational algebra embedded in it), and present an algorithmic transformation of logic programs into the system of tuple-variable equations which is a -coalgebra. The solut...
متن کامل